Parallel frequent pattern discovery: Challenges and methodology
نویسندگان
چکیده
منابع مشابه
Abstract Representations and Frequent Pattern Discovery
We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be cast into the powerful language of algorithmic information theory. This allows us to formulate a simple algorithm to mine for all frequent patterns. 1
متن کاملOnline Grammar Compression for Frequent Pattern Discovery
Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar compression develops a smaller CFG by finding duplicated patterns and removing them. This process is just a frequent pattern discovery by grammatical inference. While we can get any frequent pattern in linear time usi...
متن کاملPattern-growth based frequent serial episode discovery
Article history: Received 28 October 2011 Received in revised form 23 June 2013 Accepted 25 June 2013 Available online 13 July 2013 Frequent episode discovery is a popular framework for pattern discovery from sequential data. It has found many applications in domains like alarmmanagement in telecommunication networks, fault analysis in the manufacturing plants, predicting user behavior in web c...
متن کاملFrequent Sequential Pattern Discovery for Data Screening
To early detect and defend the threats in the Internet caused by botnet, darknet monitoring is very important to understand various botnet activities. However, common illegal accesses by ordinary malwares makes such detection difficult. In this paper, in order to remove such accesses by ordinary malwares from the results of network monitoring, we propose a data screening method based on finding...
متن کاملApproximate Frequent Pattern Discovery Over Data Stream
Frequent pattern discovery over data stream is a hard problem because a continuously generated nature of stream does not allow a revisit on each data element. Furthermore, pattern discovery process must be fast to produce timely results. Based on these requirements, we propose an approximate approach to tackle the problem of discovering frequent patterns over continuous stream. Our approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2007
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(07)70181-5